Symbolic Analysis of OTRAs-Based Circuits

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Interface Circuits and Symbolic Analysis

In this paper, an industrial application of symbolic modeling methods to the design of interface circuits is presented. A modeling method based on circuit knowledge and performance-oriented error estimation is used for an automatic generation of analog behavioral models. Results calculated with an output buffer show the effectiveness of this approach.

متن کامل

Application for Symbolic Analysis of Linear Circuits Including Switched Circuits

This paper presents a tool for symbolic analysis of electronic circuits – continuous-time circuits and periodically switched linear (PSL) circuits. Applied method of analysis is based on modeling of periodically switched networks by mixed s, z description. The method is implemented in program MapleTM in the form of Maple package named PraSCAn. Current version of the package provides all basic a...

متن کامل

Static Simulation of CNTFET-based Digital Circuits

   In this paper we implement a simple DC model for CNTFETs already proposed by us in order to carry out static analysis of basic digital circuits. To verify the validity of the obtained results, they are compared with those of Wong model, resulting in good agreement, but obtaining a lighter ensuring compile and shorter execution time, which are the main character...

متن کامل

SIASCA: Interactive System for the Symbolic Analysis of Analog Circuits

An interactive system called SIASCA which automates the calculation of symbolic expressions (SEs) representing the dominant behavior of analog circuits, is introduced. SIASCA includes a more general class of active devices whose behavior is modeled at different levels of abstraction using nullors in order to enhance the capability of symbolic analysis to calculate simplified SEs. Key-Words: Sym...

متن کامل

Symbolic security of garbled circuits

We present the first computationally sound symbolic analysis of Yao’s garbled circuit construction for secure two party computation. Our results include an extension of the symbolic language for cryptographic expressions from previous work on computationally sound symbolic analysis, and a soundness theorem for this extended language. We then demonstrate how the extended language can be used to ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Applied Research and Technology

سال: 2011

ISSN: 2448-6736,1665-6423

DOI: 10.22201/icat.16656423.2011.9.01.450